1948B - Array Fix - CodeForces Solution


brute force dp greedy

Please click on ads to support us..

Python Code:

def can_be_sorted(n, array):
    last_digit = 0
    for number in array:
        if number >= 10:
            tens_digit = number // 10
            units_digit = number % 10
            if last_digit <= tens_digit <= units_digit:
                last_digit = units_digit
            elif last_digit <= number:
                last_digit = number
            else:
                return "NO"
        else:
            if number >= last_digit:
                last_digit = number
            else:
                return "NO"
    return "YES"

def main():
    test_cases = int(input())
    for _ in range(test_cases):
        length = int(input())
        array = list(map(int, input().split()))
        print(can_be_sorted(length, array))

if __name__ == "__main__":
    main()


Comments

Submit
0 Comments
More Questions

979A - Pizza Pizza Pizza
731A - Night at the Museum
742A - Arpa’s hard exam and Mehrdad’s naive cheat
1492A - Three swimmers
1360E - Polygon
1517D - Explorer Space
1230B - Ania and Minimizing
1201A - Important Exam
676A - Nicholas and Permutation
431A - Black Square
474B - Worms
987B - High School Become Human
1223A - CME
1658B - Marin and Anti-coprime Permutation
14B - Young Photographer
143A - Help Vasilisa the Wise 2
320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet
981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits